Random Permutation Set
نویسندگان
چکیده
For exploring the meaning of power set in evidence theory, a possible explanation is proposed from view Pascal’s triangle and combinatorial number. Here comes question: what would happen if number replaced by permutation number? To address this issue, new kind set, named as random (RPS), paper, which consists event space (PES) mass function (PMF). The PES certain considers all that set. elements are called events. PMF describes chance happen. Based on PMF, RPS can be viewed permutation-based generalization finite Besides, right intersection (RI) left (LI) events presented. RI LI, orthogonal sum (ROS) (LOS) PMFs proposed. In addition, numerical examples shown to illustrate conceptions. comparisons probability discussed summarized. Moreover, an RPS-based data fusion algorithm applied threat assessment. experimental results show reasonably efficiently deal with uncertainty assessment respect ranking reliability ranking.
منابع مشابه
Key Based Random Permutation (KBRP)
This study introduces a method for generating a particular permutation P of a given size N out of N! permutations from a given key. This method computes a unique permutation for a specific size since it takes the same key; therefore, the same permutation can be computed each time the same key and size are applied. The name of random permutation comes from the fact that the probability of gettin...
متن کاملRandom Permutation Online Isotonic Regression
FORWARD ALGORITHMS Two observations: • PAVA is efficient and generalizes to partial orders • Follow The Leader algorithms are common in practice Forward Algorithm: To predict at xt, imagine y′ t ∈ [0, 1], compute f∗ on {(x1, y1) . . . (xt−1, yt−1)} ∪ {(xt, y′ t)}, and play ŷt = f(xt). FORWARD ALGORITHM EXAMPLES • IR-Int: Compute f∗ on past data. Predict with average of f∗ at nearest xi. • Inter...
متن کاملPermutations on the Random Permutation
The random permutation is the Fräıssé limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39 closed supergroups of the automorphism group of the random permutation, and thereby expose all symmetries of this structure. Equivalently, we classify all struct...
متن کامل2 Pseudo-random Spectrum Permutation
In the previous lecture, we discussed a sparse FFT algorithm that ran in O(k log n) time but was accompanied by a few caveats. The algorithm was based on the idea that aliasing the frequency spectrum could be efficiently achieved by computing the Fourier transform of a subsampling of the input signal. This aliasing could be achieved by binning the frequency indices using a pair of co-prime alia...
متن کاملEncryption using pseudo random permutation
Data encryption is to conceal the information content of secret data. It is different from data hiding where the objective is to conceal the existence of secret data. A reversible data encryption technique can extract intended information content from the encrypted data without any loss of information. The decryption process should be done at legitimate or authentic receiver end. The encrypted ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2022
ISSN: ['1841-9844', '1841-9836']
DOI: https://doi.org/10.15837/ijccc.2022.1.4542